Efficiently approximating color-spanning balls

Approximating Boundary-Triangulated Objects with Balls∗

We compute a set of balls that approximates a given 3D object, and we derive small additive bounds for the overhead in balls with respect to the minimal solution with the same quality. The algorithm has been implemented and tested using the CGAL library [7].

Smallest Color-Spanning Objects

Motivated by questions in location planning, we show for a set of colored point sites in the plane how to compute the smallest (by perimeter or area) axis-parallel rectangle, the narrowest strip, and other smallest objects enclosing at least one site of each color.

Efficiently approximating query optimizer plan diagrams

Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the optimizer over the query parameter space. These diagrams have proved to be a powerful metaphor for the analysis and redesign of modern optimizers, and are gaining currency in diverse industrial and academic institutions...

Shortest Color-Spanning Intervals

Approximating Bounded Degree Maximum Spanning Subgraphs∗

The bounded degree maximum spanning subgraph problem arising from wireless mesh networks is studied here. Given a connected graph G and a positive integer d ≥ 2, the problem aims to find a maximum spanning subgraph H of G with the constraint: for every vertex v of G, the degree of v in H, dH(v), is less than or equal to d. Here, a spanning subgraph is a connected subgraph which contains all the...